Lessons Learned from Prototyping Parallel Computer Architectures for AI Algorithms

نویسنده

  • Bernhard Rinner
چکیده

Since many years algorithms from the eld of arti cial intelligence (AI) have been targeted for parallelization, i.e., partitioning the search problem and distributing the subproblems among multiple processing nodes. This paper reports on our experience in parallelizing and distributing AI algorithms, i.e., the design and prototype implementation of parallel computer architectures for AI algorithms. While the presented prototypes have been designed for speci c applications, the underlying algorithms are quite general and frequently-used AI search methods, i.e., constraint satisfaction and simulated annealing. Our prototypes achieve speedup factors of several orders of magnitude. keywords: parallel and distributed AI; specialized computer architecture; constraint satisfaction; simulated annealing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Platform for Rapid Prototyping of AI Architectures

Researching artificial intelligence (AI) is a big endeavour. It calls for agile collaboration among research teams, fast sharing of work between developers, and the easy testing of new hypotheses. Our primary contribution is a novel simulation platform for the prototyping of new algorithms with a variety of tools for visualization and debugging. The advantages of this platform are presented wit...

متن کامل

Why Programming-By-Demonstration Systems Fail: Lessons Learned for Usable AI

enable ordinary end users to create programs without needing to learn the arcane details of programming languages, but simply by demonstrating what their program should do. If PBD were successful, the vast population of nonprogrammer computer users would be able to take control of their computing experience and create programs to automate routine tasks, develop applications for their specific n...

متن کامل

A Parallel Algorithm for the Technology Mapping of LUT-Based FPGAs

Flowmap ((1]) was the rst delay-optimal algorithm for the technology mapping of LUT-based FPGAs. However, even though this algorithm is polynomial, rapid prototyping using FPGAs requires faster solutions. This paper provides an eecient parallelization of flowmap that minimizes locking on shared memory architectures. The innuence of scheduling strategies and technology-speciic parameters on spee...

متن کامل

Regionalization of the Iowa State University Extension System: Lessons Learned by Key Administrators

The cyclical economic downturn in the United States has forced many Extension administrators to rethink and adjust services and programming. The Cooperative Extension System (CES), the organization primarily responsible for governmental Extension work in the United States, at Iowa State University responded to this economic downturn by restructuring its organization from county based to a regio...

متن کامل

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000